A Classification of Ordinal Topologies

نویسنده

  • VINCENT KIEFTENBELD
چکیده

Ordinals carry a natural topology induced by their linear order. In this note, we classify the homeomorphism types of all ordinal topologies using the Cantor normal form and the notion of the Cantor–Bendixson rank of a point. Let < be a linear order on a set X. The order topology on X is generated by the subbase of rays of the form leftX(b) := {x ∈ X : x < b} and rightX(a) := {x ∈ X : a < x} for a, b ∈ X. Natural examples of order topologies are the standard topologies on N, Q, and R. Ordinals provide another source for natural order topologies; we call these ordinal topologies. These topologies have many discrete points: if ξ < ξ + 1 < α, then ξ + 1 is a discrete point and the topological space α splits disjointly into the open sets leftα(ξ + 1) and rightα(ξ). We shall provide a complete homeomorphic invariant for ordinal topologies, using the Cantor normal form and the notion of the Cantor-Bendixson rank. The intuition behind this classification is that ordinal topologies are mainly determined by their limit points. Recall that every nonzero ordinal α can be written uniquely in Cantor normal form (to base ω) as α = ω0 · k0 + · · · + ω αn · kn, where α ≥ α0 > · · · > αn and 0 < ki < ω for 0 ≤ i ≤ n [Je03, Theorem 2.26]. We define the limit complexity of α as lc(α) := α0, the coefficient of α as c(α) := k0 and the purity of α as p(α) := { 0 if α = ω · c(α) ≥ ω, and ωn otherwise. We call α a pure limit ordinal if p(α) = 0, and an impure limit ordinal if p(α) > 1. Of course, α is a successor ordinal iff p(α) = 1. We shall show that these three data provide a complete homeomorphic invariant for ordinal topologies: Main Theorem. For any two ordinals α and β, the ordinal topologies on α and β are homeomorphic (written α ∼= β) if and only if 〈lc(α), c(α),p(α)〉 = 〈lc(β), c(β),p(β)〉. 2000 Mathematics Subject Classification. Primary 03E10; 06F30.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Derived Topologies on Ordinals and Stationary Reflection

We study the transfinite sequence of topologies on the ordinal numbers that is obtained through successive closure under Cantor’s derivative operator on sets of ordinals, starting form the usual interval topology. We characterize the non-isolated points in the ξ-th topology as those ordinals that satisfy a strong iterated form of stationary reflection, which we call ξ-simultaneous-reflection. W...

متن کامل

New phase II control chart for monitoring ordinal contingency table based processes

In some statistical process monitoring applications, quality of a process or product is described by more than one ordinal factors called ordinal multivariate process. To show the relationship between these factors, an ordinal contingency table is used and modeled with ordinal log-linear model. In this paper, a new control charts based on ordinal-normal statistic is developed to monitor the ord...

متن کامل

Customer Level Classification Model Using Ordinal Multiclass Support Vector Machines*

Conventional Support Vector Machines (SVMs) have been utilized as classifiers for binary classification problems. However, certain real world problems, including corporate bond rating, cannot be addressed by binary classifiers because these are multi-class problems. For this reason, numerous studies have attempted to transform the original SVM into a multiclass classifier. These studies, howeve...

متن کامل

Ordinal Classification Using Partially Ordered Feature Sets

This paper presents a method to solve an ordinal classification problem where the objects are described with a set of partially ordered features. To construct an ordinal classification model we aggregate partial orders of features by weighting the incidence matrices of partial order graphs. To describe set of possible solutions we use partial order cones corresponding to the incidence matrices ...

متن کامل

Reduction from Cost-Sensitive Ordinal Ranking to Weighted Binary Classification

We present a reduction framework from ordinal ranking to binary classification. The framework consists of three steps: extracting extended examples from the original examples, learning a binary classifier on the extended examples with any binary classification algorithm, and constructing a ranker from the binary classifier. Based on the framework, we show that a weighted 0/1 loss of the binary ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006